Statistical physics of hard optimization problems
نویسندگان
چکیده
منابع مشابه
Statistical Physics of Hard Optimization Problems
ix Title: Statistical Physics of Hard Optimization Problems Author: Lenka Zdeborová Abstract: Optimization is fundamental in many areas of science, from computer science and information theory to engineering and statistical physics, as well as to biology or social sciences. It typically involves a large number of variables and a cost function depending on these variables. Optimization problems ...
متن کاملStatistical physics of hard combinatorial optimization: The vertex cover problem
Typical-case computation complexity is a research topic at the boundary of computer science, applied mathematics, and statistical physics. In the last twenty years the replica-symmetry-breaking mean field theory of spin glasses and the associated message-passing algorithms have greatly deepened our understanding of typical-case computation complexity. In this paper we use the vertex cover probl...
متن کاملStatistical Physics of Inference problems
1 Lecture 1 3 1.1 Bayesian Inference and Estimators . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.1.1 The Bayes formula . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.1.2 Estimators . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 1.2 A toy example in denoising . . . . . . . . . . . . . . . . . . . . ....
متن کاملRandom Walk Problems Motivated by Statistical Physics
This paper is a an expanded version of a talk that I gave at the St. Petersburg summer school on probability and statistical physics in 2012. I discuss the state of research and open problems on three models that arise in equlibirum statistical physics: self-avoiding random walk, loop-erased random walk, and intersections of paths of simple random walks.
متن کاملApproximation algorithms for NP-hard optimization problems
In this chapter, we discuss approximation algorithms for optimization problems. An optimization problem consists in finding the best (cheapest, heaviest, etc.) element in a large set P, called the feasible region and usually specified implicitly, where the quality of elements of the set are evaluated using a function f(x), the objective function, usually something fairly simple. The element tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Physica Slovaca. Reviews and Tutorials
سال: 2009
ISSN: 1336-040X,0323-0465
DOI: 10.2478/v10155-010-0096-6